Random suffix search trees
نویسندگان
چکیده
A random suffix search tree is a binary search tree constructed for the suffixes Xi = 0.BiBi+1Bi+2 . . . of a sequence B1, B2, B3., . . . of independent identically distributed random b-ary digits Bj . Let Dn denote the depth of the node for Xn in this tree when B1 is uniform on Zb. We show that for any value of b > 1, EDn = 2 log n + O(log log n), just as for the random binary search tree. We also show that Dn/EDn → 1 in probability. AMS subject classifications. Primary: 60D05; secondary: 68U05.
منابع مشابه
Suffix trees for inputs larger than main memory
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current methods for constructing suffix trees do not scale for large inputs. As suffix trees are larger than the input sequences and quickly outgrow the main memory, the first attempts at building large suffix trees focused on algo...
متن کاملA Partition-Based Suffix Tree Construction and Its Applications
A suffix tree (also called suffix trie, PAT tree or, position tree) is a powerful data structure that presents the suffixes of a given string in a way that allows a fast implementation of important string operations. The idea behind suffix trees is to assign to each symbol of a string an index corresponding to its position in the string. The first symbol in the string will have the index 1, the...
متن کاملSearch-Optimized Persistent Suffix Tree Storage for Biological Applications
The suffix tree is a well known and popular indexing structure for various sequence processing problems arising in biological data management. However, unlike traditional indexing structures, suffix trees are orders of magnitude larger than the underlying data. Moreover, their construction and search algorithms are extremely inefficient when implemented directly on disk. Recently, we have shown...
متن کاملEfficient multifeature index structures for music data retrieval
In this paper, we propose four index structures for music data retrieval. Based on suffix trees, we develop two index structures called Combined Suffix Tree and Independent Suffix Trees. These methods still show shortcomings for some search functions. Hence we develop another index, called Twin Suffix Trees, to overcome these problems. However, the Twin Suffix Trees lack of scalability when the...
متن کاملSuffix Arrays on Words
Surprisingly enough, it is not yet known how to build directly a suffix array that indexes just the k positions at word-boundaries of a text T [1, n], taking O(n) time and O(k) space in addition to T . We propose a class-note solution to this problem that achieves such optimal time and space bounds. Word-based versions of indexes achieving the same time/space bounds were already known for suffi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Random Struct. Algorithms
دوره 23 شماره
صفحات -
تاریخ انتشار 2003